<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="zh">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.11.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>cppMISC: tree&lt; type, metaType, T &gt;::treeNode类 参考</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript" src="../../darkmode_toggle.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">cppMISC<span id="projectnumber">&#160;v1.1</span>
   </div>
   <div id="projectbrief">cppMisc 文档系统</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.11.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('../../',true,false,'search.php','搜索',false);
  $(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">载入中...</div>
<div class="SRStatus" id="Searching">搜索中...</div>
<div class="SRStatus" id="NoMatches">未找到</div>
</div>
</div>
</div>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="../../d4/d4d/classtree.html">tree</a></li><li class="navelem"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a></li>  </ul>
</div>
</div><!-- top -->
<div id="doc-content">
<div class="header">
  <div class="summary">
<a href="#pub-methods">Public 成员函数</a> &#124;
<a href="#friends">友元</a> &#124;
<a href="../../df/d1e/classtree_1_1tree_node-members.html">所有成员列表</a>  </div>
  <div class="headertitle"><div class="title">tree&lt; type, metaType, T &gt;::treeNode类 参考</div></div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a>&gt;</code></p>
<div class="dynheader">
tree&lt; type, metaType, T &gt;::treeNode 的协作图:</div>
<div class="dyncontent">
<div class="center"><img src="../../da/dad/classtree_1_1tree_node__coll__graph.png" border="0" usemap="#atree_3_01type_00_01meta_type_00_01_t_01_4_1_1tree_node_coll__map" alt="Collaboration graph"/></div>
<map name="atree_3_01type_00_01meta_type_00_01_t_01_4_1_1tree_node_coll__map" id="atree_3_01type_00_01meta_type_00_01_t_01_4_1_1tree_node_coll__map">
<area shape="rect" title=" " alt="" coords="5,5,205,384"/>
</map>
</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public 成员函数</h2></td></tr>
<tr class="memitem:a1dd627bd23e96af4a68b0a7a5830619d" id="r_a1dd627bd23e96af4a68b0a7a5830619d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1dd627bd23e96af4a68b0a7a5830619d">treeNode</a> ()</td></tr>
<tr class="separator:a1dd627bd23e96af4a68b0a7a5830619d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aac5f3e17a76c49ff81817aec3c1c8780" id="r_aac5f3e17a76c49ff81817aec3c1c8780"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aac5f3e17a76c49ff81817aec3c1c8780">treeNode</a> (bool, bool allocData=false)</td></tr>
<tr class="memdesc:aac5f3e17a76c49ff81817aec3c1c8780"><td class="mdescLeft">&#160;</td><td class="mdescRight">构造函数  <br /></td></tr>
<tr class="separator:aac5f3e17a76c49ff81817aec3c1c8780"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a086d898d9e46f2eac5c4f10f6a355c74" id="r_a086d898d9e46f2eac5c4f10f6a355c74"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a086d898d9e46f2eac5c4f10f6a355c74">treeNode</a> (const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;b)</td></tr>
<tr class="separator:a086d898d9e46f2eac5c4f10f6a355c74"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab0146505d2a1d903a205dacb84e8db6c" id="r_ab0146505d2a1d903a205dacb84e8db6c"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab0146505d2a1d903a205dacb84e8db6c">treeNode</a> (<a class="el" href="../../d4/d4d/classtree.html#a5a303c900a625a4f4b2d7476b61bae24">reference</a> data)</td></tr>
<tr class="separator:ab0146505d2a1d903a205dacb84e8db6c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7d3a9fcb97cd66d2e016a0ff4e85ae13" id="r_a7d3a9fcb97cd66d2e016a0ff4e85ae13"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7d3a9fcb97cd66d2e016a0ff4e85ae13">treeNode</a> (<a class="el" href="../../d4/d4d/classtree.html#af759e7012e9659595dcc1ba52d4b326f">pointer</a> data)</td></tr>
<tr class="separator:a7d3a9fcb97cd66d2e016a0ff4e85ae13"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aadc607d5db838b5b9f66e9a53d882dfd" id="r_aadc607d5db838b5b9f66e9a53d882dfd"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aadc607d5db838b5b9f66e9a53d882dfd">treeNode</a> (<a class="el" href="../../d4/d4d/classtree.html#a1b7a5e12c580b76d8615985ede1ed40d">value_type</a> &amp;&amp;data)</td></tr>
<tr class="separator:aadc607d5db838b5b9f66e9a53d882dfd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af3f0b583e7dc0103ceaffb54444a127a" id="r_af3f0b583e7dc0103ceaffb54444a127a"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3f0b583e7dc0103ceaffb54444a127a">treeNode</a> (<a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *<a class="el" href="#afec2c41157f226f9f9da46bcb9afa8ac">parent</a>, const <a class="el" href="../../d4/d4d/classtree.html#a5a303c900a625a4f4b2d7476b61bae24">reference</a> data)</td></tr>
<tr class="separator:af3f0b583e7dc0103ceaffb54444a127a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a19e0625ba488c7682d84b5070a0574f9" id="r_a19e0625ba488c7682d84b5070a0574f9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a19e0625ba488c7682d84b5070a0574f9">clone</a> ()</td></tr>
<tr class="memdesc:a19e0625ba488c7682d84b5070a0574f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">克隆一个节点。这个节点的值和当前节点一致。  <br /></td></tr>
<tr class="separator:a19e0625ba488c7682d84b5070a0574f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad2cf65556e46fdd7e5736adb4d8a367e" id="r_ad2cf65556e46fdd7e5736adb4d8a367e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad2cf65556e46fdd7e5736adb4d8a367e">deepClone</a> ()</td></tr>
<tr class="separator:ad2cf65556e46fdd7e5736adb4d8a367e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa94b45501c864106006ac87825ad3aa5" id="r_aa94b45501c864106006ac87825ad3aa5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa94b45501c864106006ac87825ad3aa5">operator=</a> (const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;b)</td></tr>
<tr class="memdesc:aa94b45501c864106006ac87825ad3aa5"><td class="mdescLeft">&#160;</td><td class="mdescRight">节点数据拷贝  <br /></td></tr>
<tr class="separator:aa94b45501c864106006ac87825ad3aa5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae5ca39e8aafe222703261df1a4d52471" id="r_ae5ca39e8aafe222703261df1a4d52471"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae5ca39e8aafe222703261df1a4d52471">operator==</a> (const <a class="el" href="../../d4/d4d/classtree.html#a1b7a5e12c580b76d8615985ede1ed40d">value_type</a> &amp;b)</td></tr>
<tr class="memdesc:ae5ca39e8aafe222703261df1a4d52471"><td class="mdescLeft">&#160;</td><td class="mdescRight">比对节点是否相等  <br /></td></tr>
<tr class="separator:ae5ca39e8aafe222703261df1a4d52471"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab8cc3b4711e970237acf414044696da7" id="r_ab8cc3b4711e970237acf414044696da7"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab8cc3b4711e970237acf414044696da7">operator==</a> (const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;b)</td></tr>
<tr class="separator:ab8cc3b4711e970237acf414044696da7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afec2c41157f226f9f9da46bcb9afa8ac" id="r_afec2c41157f226f9f9da46bcb9afa8ac"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afec2c41157f226f9f9da46bcb9afa8ac">parent</a> ()</td></tr>
<tr class="memdesc:afec2c41157f226f9f9da46bcb9afa8ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">去父亲节点  <br /></td></tr>
<tr class="separator:afec2c41157f226f9f9da46bcb9afa8ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af038db2797b1462eaa1cc42a875087f2" id="r_af038db2797b1462eaa1cc42a875087f2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af038db2797b1462eaa1cc42a875087f2">parent</a> (<a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *p)</td></tr>
<tr class="memdesc:af038db2797b1462eaa1cc42a875087f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">指定父亲节点  <br /></td></tr>
<tr class="separator:af038db2797b1462eaa1cc42a875087f2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0577532f377d701d96c4822b3fc45192" id="r_a0577532f377d701d96c4822b3fc45192"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0577532f377d701d96c4822b3fc45192">push_child</a> (const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;n)</td></tr>
<tr class="memdesc:a0577532f377d701d96c4822b3fc45192"><td class="mdescLeft">&#160;</td><td class="mdescRight">添加孩子节点。这个操作在孩子节点的最后追加内容  <br /></td></tr>
<tr class="separator:a0577532f377d701d96c4822b3fc45192"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a73c9ec86ad94e0fcffca2c97d68a5b6c" id="r_a73c9ec86ad94e0fcffca2c97d68a5b6c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a73c9ec86ad94e0fcffca2c97d68a5b6c">push_child</a> (<a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *node)</td></tr>
<tr class="separator:a73c9ec86ad94e0fcffca2c97d68a5b6c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad60ae0d2ef5ed5d67141975493bc257c" id="r_ad60ae0d2ef5ed5d67141975493bc257c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad60ae0d2ef5ed5d67141975493bc257c">sibling</a> ()</td></tr>
<tr class="memdesc:ad60ae0d2ef5ed5d67141975493bc257c"><td class="mdescLeft">&#160;</td><td class="mdescRight">取弟弟节点指针  <br /></td></tr>
<tr class="separator:ad60ae0d2ef5ed5d67141975493bc257c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8547b8461dcb4910d53d315dcfeea72f" id="r_a8547b8461dcb4910d53d315dcfeea72f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8547b8461dcb4910d53d315dcfeea72f">sibling</a> (<a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *node)</td></tr>
<tr class="memdesc:a8547b8461dcb4910d53d315dcfeea72f"><td class="mdescLeft">&#160;</td><td class="mdescRight">指定弟弟节点指针  <br /></td></tr>
<tr class="separator:a8547b8461dcb4910d53d315dcfeea72f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4b4b7f6f107e9504e8cdc5427951bbbd" id="r_a4b4b7f6f107e9504e8cdc5427951bbbd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4b4b7f6f107e9504e8cdc5427951bbbd">children</a> ()</td></tr>
<tr class="separator:a4b4b7f6f107e9504e8cdc5427951bbbd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5266036cd52f10aa9a771ec7a3aac2a2" id="r_a5266036cd52f10aa9a771ec7a3aac2a2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5266036cd52f10aa9a771ec7a3aac2a2">children</a> (<a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *node)</td></tr>
<tr class="separator:a5266036cd52f10aa9a771ec7a3aac2a2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a54951c8d6a396be5c3ef091cae7386e5" id="r_a54951c8d6a396be5c3ef091cae7386e5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a54951c8d6a396be5c3ef091cae7386e5">pre</a> ()</td></tr>
<tr class="separator:a54951c8d6a396be5c3ef091cae7386e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8b98396d128d71c2c1dc053130bce09e" id="r_a8b98396d128d71c2c1dc053130bce09e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8b98396d128d71c2c1dc053130bce09e">pre</a> (<a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *node)</td></tr>
<tr class="separator:a8b98396d128d71c2c1dc053130bce09e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7b3be6afa52cd3925fee6d4a242dc11c" id="r_a7b3be6afa52cd3925fee6d4a242dc11c"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="../../d4/d4d/classtree.html#a1b7a5e12c580b76d8615985ede1ed40d">value_type</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7b3be6afa52cd3925fee6d4a242dc11c">value</a> () const</td></tr>
<tr class="separator:a7b3be6afa52cd3925fee6d4a242dc11c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a18d37a3a72ba31ff3450f33e21de1415" id="r_a18d37a3a72ba31ff3450f33e21de1415"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="../../d4/d4d/classtree.html#af759e7012e9659595dcc1ba52d4b326f">pointer</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a18d37a3a72ba31ff3450f33e21de1415">value_ptr</a> () const</td></tr>
<tr class="separator:a18d37a3a72ba31ff3450f33e21de1415"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae7243bec559d25f9a180e6edf3c1d8e1" id="r_ae7243bec559d25f9a180e6edf3c1d8e1"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae7243bec559d25f9a180e6edf3c1d8e1">get</a> () const</td></tr>
<tr class="separator:ae7243bec559d25f9a180e6edf3c1d8e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
友元</h2></td></tr>
<tr class="memitem:a274b977404a53ceb91af64dfd96c9641" id="r_a274b977404a53ceb91af64dfd96c9641"><td class="memItemLeft" align="right" valign="top">class&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a274b977404a53ceb91af64dfd96c9641">tree</a></td></tr>
<tr class="separator:a274b977404a53ceb91af64dfd96c9641"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">详细描述</h2>
<div class="textblock"><div class="compoundTemplParams">template&lt;typename type, typename metaType = typename std::decay&lt; type &gt; :: type, typename T = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt;<br />
class tree&lt; type, metaType, T &gt;::treeNode</div><p>定义树节点 </p>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00048">48</a> 行定义.</p>
</div><h2 class="groupheader">构造及析构函数说明</h2>
<a id="a1dd627bd23e96af4a68b0a7a5830619d" name="a1dd627bd23e96af4a68b0a7a5830619d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1dd627bd23e96af4a68b0a7a5830619d">&#9670;&#160;</a></span>treeNode() <span class="overload">[1/7]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::treeNode </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00058">58</a> 行定义.</p>
<div class="dynheader">
这是这个函数的调用关系图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_a1dd627bd23e96af4a68b0a7a5830619d_icgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_a1dd627bd23e96af4a68b0a7a5830619d_icgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_a1dd627bd23e96af4a68b0a7a5830619d_icgraph" id="ad1/d44/classtree_1_1tree_node_a1dd627bd23e96af4a68b0a7a5830619d_icgraph">
<area shape="rect" title=" " alt="" coords="500,56,666,83"/>
<area shape="rect" href="../../d1/d44/classtree_1_1tree_node.html#a19e0625ba488c7682d84b5070a0574f9" title="克隆一个节点。这个节点的值和当前节点一致。" alt="" coords="294,5,437,32"/>
<area shape="poly" title=" " alt="" coords="507,54,425,35,426,30,508,49"/>
<area shape="rect" href="../../d1/d44/classtree_1_1tree_node.html#ad2cf65556e46fdd7e5736adb4d8a367e" title=" " alt="" coords="278,56,452,83"/>
<area shape="poly" title=" " alt="" coords="484,72,453,72,453,67,484,67"/>
<area shape="rect" href="../../d1/d44/classtree_1_1tree_node.html#a0577532f377d701d96c4822b3fc45192" title="添加孩子节点。这个操作在孩子节点的最后追加内容" alt="" coords="295,107,435,149"/>
<area shape="poly" title=" " alt="" coords="517,90,437,112,435,107,515,85"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed" title="在给定的父节点下添加一个孩子节点。这个函数只会在父节点下的所有孩子节点最后添加" alt="" coords="147,39,230,65"/>
<area shape="poly" title=" " alt="" coords="291,103,277,97,216,68,218,63,279,92,293,98"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a71b5751a6a55395afe0e65c28e37597a" title=" " alt="" coords="147,89,230,116"/>
<area shape="poly" title=" " alt="" coords="279,118,230,111,231,106,280,113"/>
<area shape="rect" href="../../d4/d4d/classtree.html#ad2c4e9d187d6364bb08bbeb233949687" title=" " alt="" coords="147,140,230,167"/>
<area shape="poly" title=" " alt="" coords="280,143,231,150,230,145,279,138"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a265eb5fcb1aab37f8bfc746f6bf4fb77" title=" " alt="" coords="147,191,230,217"/>
<area shape="poly" title=" " alt="" coords="301,159,222,193,220,188,298,154"/>
<area shape="rect" href="../../dc/d2f/classfs.html#aca59d4eca486930e503c0e6902ae591c" title="枚举文件，将指定目录按照原本的结构整理成一个可以以树形结构遍历的数据" alt="" coords="5,13,99,40"/>
<area shape="poly" title=" " alt="" coords="131,44,99,38,100,33,132,39"/>
<area shape="rect" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title=" " alt="" coords="27,64,77,91"/>
<area shape="poly" title=" " alt="" coords="132,65,78,75,77,70,131,60"/>
</map>
</div>

</div>
</div>
<a id="aac5f3e17a76c49ff81817aec3c1c8780" name="aac5f3e17a76c49ff81817aec3c1c8780"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aac5f3e17a76c49ff81817aec3c1c8780">&#9670;&#160;</a></span>treeNode() <span class="overload">[2/7]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::treeNode </td>
          <td>(</td>
          <td class="paramtype">bool</td>          <td class="paramname"><span class="paramname"><em></em></span>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">bool</td>          <td class="paramname"><span class="paramname"><em>allocData</em></span><span class="paramdefsep"> = </span><span class="paramdefval">false</span>&#160;)</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>构造函数 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">parent</td><td>[ I ] 父亲节点指针 </td></tr>
    <tr><td class="paramname">value</td><td>[ I ] 数据 </td></tr>
    <tr><td class="paramname">is_root[</td><td>I ] 是否是根节点 @exceptions 内存分配失败后抛出std::bad_alloc </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00073">73</a> 行定义.</p>

</div>
</div>
<a id="a086d898d9e46f2eac5c4f10f6a355c74" name="a086d898d9e46f2eac5c4f10f6a355c74"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a086d898d9e46f2eac5c4f10f6a355c74">&#9670;&#160;</a></span>treeNode() <span class="overload">[3/7]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::treeNode </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00085">85</a> 行定义.</p>

</div>
</div>
<a id="ab0146505d2a1d903a205dacb84e8db6c" name="ab0146505d2a1d903a205dacb84e8db6c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab0146505d2a1d903a205dacb84e8db6c">&#9670;&#160;</a></span>treeNode() <span class="overload">[4/7]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::treeNode </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d4/d4d/classtree.html#a5a303c900a625a4f4b2d7476b61bae24">reference</a></td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00092">92</a> 行定义.</p>

</div>
</div>
<a id="a7d3a9fcb97cd66d2e016a0ff4e85ae13" name="a7d3a9fcb97cd66d2e016a0ff4e85ae13"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7d3a9fcb97cd66d2e016a0ff4e85ae13">&#9670;&#160;</a></span>treeNode() <span class="overload">[5/7]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::treeNode </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d4/d4d/classtree.html#af759e7012e9659595dcc1ba52d4b326f">pointer</a></td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00099">99</a> 行定义.</p>

</div>
</div>
<a id="aadc607d5db838b5b9f66e9a53d882dfd" name="aadc607d5db838b5b9f66e9a53d882dfd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aadc607d5db838b5b9f66e9a53d882dfd">&#9670;&#160;</a></span>treeNode() <span class="overload">[6/7]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::treeNode </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d4/d4d/classtree.html#a1b7a5e12c580b76d8615985ede1ed40d">value_type</a> &amp;&amp;</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00106">106</a> 行定义.</p>

</div>
</div>
<a id="af3f0b583e7dc0103ceaffb54444a127a" name="af3f0b583e7dc0103ceaffb54444a127a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af3f0b583e7dc0103ceaffb54444a127a">&#9670;&#160;</a></span>treeNode() <span class="overload">[7/7]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::treeNode </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *</td>          <td class="paramname"><span class="paramname"><em>parent</em></span>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="../../d4/d4d/classtree.html#a5a303c900a625a4f4b2d7476b61bae24">reference</a></td>          <td class="paramname"><span class="paramname"><em>data</em></span>&#160;)</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00114">114</a> 行定义.</p>

</div>
</div>
<h2 class="groupheader">成员函数说明</h2>
<a id="a4b4b7f6f107e9504e8cdc5427951bbbd" name="a4b4b7f6f107e9504e8cdc5427951bbbd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4b4b7f6f107e9504e8cdc5427951bbbd">&#9670;&#160;</a></span>children() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> * <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::children </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00265">265</a> 行定义.</p>
<div class="dynheader">
这是这个函数的调用关系图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_a4b4b7f6f107e9504e8cdc5427951bbbd_icgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_a4b4b7f6f107e9504e8cdc5427951bbbd_icgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_a4b4b7f6f107e9504e8cdc5427951bbbd_icgraph" id="ad1/d44/classtree_1_1tree_node_a4b4b7f6f107e9504e8cdc5427951bbbd_icgraph">
<area shape="rect" title=" " alt="" coords="470,81,628,108"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a195cb527a182cacf1bfa1521a7a64e91" title="后根遍历" alt="" coords="306,5,407,32"/>
<area shape="poly" title=" " alt="" coords="499,78,421,46,392,35,394,30,423,42,501,73"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a56c4fd6197458cd9221aa73ca1292555" title="后根遍历，采用后根遍历非常方便销毁对象" alt="" coords="299,56,414,83"/>
<area shape="poly" title=" " alt="" coords="455,85,415,80,415,74,456,80"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a0b33cf4bc78530efd6c2504b49b2d7d3" title=" " alt="" coords="291,107,422,133"/>
<area shape="poly" title=" " alt="" coords="455,110,423,114,422,109,455,104"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a73beb0e756fc71efca1224f31e0925b7" title="删除节点" alt="" coords="310,157,404,184"/>
<area shape="poly" title=" " alt="" coords="501,117,423,148,394,159,392,154,421,143,499,112"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a764ccf0cec30d22799367817dbf77458" title="释放内容" alt="" coords="149,69,228,96"/>
<area shape="poly" title=" " alt="" coords="284,78,229,82,229,77,283,72"/>
<area shape="rect" href="../../d4/d4d/classtree.html#aca269a11ef91945884af6bc8618434e1" title=" " alt="" coords="5,69,87,96"/>
<area shape="poly" title=" " alt="" coords="134,85,87,85,87,80,134,80"/>
<area shape="poly" title=" " alt="" coords="302,153,290,148,209,99,211,94,292,143,304,149"/>
<area shape="rect" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title=" " alt="" coords="164,132,214,159"/>
<area shape="poly" title=" " alt="" coords="293,164,214,152,214,146,294,159"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a50348bdb1b8eaaeb2ec6723ec36abc94" title="条件删除操作" alt="" coords="135,183,243,209"/>
<area shape="poly" title=" " alt="" coords="294,183,244,190,243,185,294,177"/>
</map>
</div>

</div>
</div>
<a id="a5266036cd52f10aa9a771ec7a3aac2a2" name="a5266036cd52f10aa9a771ec7a3aac2a2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5266036cd52f10aa9a771ec7a3aac2a2">&#9670;&#160;</a></span>children() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::children </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *</td>          <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00266">266</a> 行定义.</p>

</div>
</div>
<a id="a19e0625ba488c7682d84b5070a0574f9" name="a19e0625ba488c7682d84b5070a0574f9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a19e0625ba488c7682d84b5070a0574f9">&#9670;&#160;</a></span>clone()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> * <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::clone </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>克隆一个节点。这个节点的值和当前节点一致。 </p>
<dl class="section return"><dt>返回</dt><dd>成功操作返回新节点的指针 @exceptions 如果内存分配失败，则抛出ERR_ALLOC_MEM </dd></dl>
<dl class="section note"><dt>注解</dt><dd>这个操作只会复制节点值，不会复制节点全部关系。如果要完全克隆调用deepClone </dd></dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00137">137</a> 行定义.</p>
<div class="dynheader">
函数调用图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_a19e0625ba488c7682d84b5070a0574f9_cgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_a19e0625ba488c7682d84b5070a0574f9_cgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_a19e0625ba488c7682d84b5070a0574f9_cgraph" id="ad1/d44/classtree_1_1tree_node_a19e0625ba488c7682d84b5070a0574f9_cgraph">
<area shape="rect" title="克隆一个节点。这个节点的值和当前节点一致。" alt="" coords="5,5,149,32"/>
<area shape="rect" href="../../d1/d44/classtree_1_1tree_node.html#a1dd627bd23e96af4a68b0a7a5830619d" title=" " alt="" coords="197,5,362,32"/>
<area shape="poly" title=" " alt="" coords="149,16,181,16,181,21,149,21"/>
</map>
</div>

</div>
</div>
<a id="ad2cf65556e46fdd7e5736adb4d8a367e" name="ad2cf65556e46fdd7e5736adb4d8a367e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad2cf65556e46fdd7e5736adb4d8a367e">&#9670;&#160;</a></span>deepClone()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> * <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::deepClone </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00148">148</a> 行定义.</p>
<div class="dynheader">
函数调用图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_ad2cf65556e46fdd7e5736adb4d8a367e_cgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_ad2cf65556e46fdd7e5736adb4d8a367e_cgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_ad2cf65556e46fdd7e5736adb4d8a367e_cgraph" id="ad1/d44/classtree_1_1tree_node_ad2cf65556e46fdd7e5736adb4d8a367e_cgraph">
<area shape="rect" title=" " alt="" coords="5,5,180,32"/>
<area shape="rect" href="../../d1/d44/classtree_1_1tree_node.html#a1dd627bd23e96af4a68b0a7a5830619d" title=" " alt="" coords="228,5,393,32"/>
<area shape="poly" title=" " alt="" coords="180,16,212,16,212,21,180,21"/>
</map>
</div>

</div>
</div>
<a id="ae7243bec559d25f9a180e6edf3c1d8e1" name="ae7243bec559d25f9a180e6edf3c1d8e1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae7243bec559d25f9a180e6edf3c1d8e1">&#9670;&#160;</a></span>get()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> * <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::get </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00293">293</a> 行定义.</p>

</div>
</div>
<a id="aa94b45501c864106006ac87825ad3aa5" name="aa94b45501c864106006ac87825ad3aa5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa94b45501c864106006ac87825ad3aa5">&#9670;&#160;</a></span>operator=()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp; <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::operator= </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>节点数据拷贝 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">b[</td><td>I ] 要拷贝的数据节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>成功操作返回节点引用 @exceptions 如果节点数值不存在，则抛出ERR_DATA_EMPTY </dd></dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00168">168</a> 行定义.</p>

</div>
</div>
<a id="ab8cc3b4711e970237acf414044696da7" name="ab8cc3b4711e970237acf414044696da7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab8cc3b4711e970237acf414044696da7">&#9670;&#160;</a></span>operator==() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::operator== </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00190">190</a> 行定义.</p>

</div>
</div>
<a id="ae5ca39e8aafe222703261df1a4d52471" name="ae5ca39e8aafe222703261df1a4d52471"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae5ca39e8aafe222703261df1a4d52471">&#9670;&#160;</a></span>operator==() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::operator== </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="../../d4/d4d/classtree.html#a1b7a5e12c580b76d8615985ede1ed40d">value_type</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>比对节点是否相等 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">b[</td><td>I ] 要比对的数值 </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>返回</dt><dd>如果相等返回true, 否则返回false @exceptions 如果节点数值不存在，则抛出ERR_DATA_EMPTY </dd></dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00183">183</a> 行定义.</p>

</div>
</div>
<a id="afec2c41157f226f9f9da46bcb9afa8ac" name="afec2c41157f226f9f9da46bcb9afa8ac"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afec2c41157f226f9f9da46bcb9afa8ac">&#9670;&#160;</a></span>parent() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> * <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::parent </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>去父亲节点 </p>
<dl class="section return"><dt>返回</dt><dd>返回父亲节点指针，如果是根节点，则返回nullptr </dd></dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00201">201</a> 行定义.</p>
<div class="dynheader">
这是这个函数的调用关系图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_afec2c41157f226f9f9da46bcb9afa8ac_icgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_afec2c41157f226f9f9da46bcb9afa8ac_icgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_afec2c41157f226f9f9da46bcb9afa8ac_icgraph" id="ad1/d44/classtree_1_1tree_node_afec2c41157f226f9f9da46bcb9afa8ac_icgraph">
<area shape="rect" title="去父亲节点" alt="" coords="433,56,582,83"/>
<area shape="rect" href="../../d4/d4d/classtree.html#ad2c4e9d187d6364bb08bbeb233949687" title=" " alt="" coords="296,5,380,32"/>
<area shape="poly" title=" " alt="" coords="445,53,379,34,381,28,446,48"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a265eb5fcb1aab37f8bfc746f6bf4fb77" title=" " alt="" coords="296,56,380,83"/>
<area shape="poly" title=" " alt="" coords="418,72,380,72,380,67,418,67"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a73beb0e756fc71efca1224f31e0925b7" title="删除节点" alt="" coords="291,107,385,133"/>
<area shape="poly" title=" " alt="" coords="447,90,386,109,385,104,445,85"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a764ccf0cec30d22799367817dbf77458" title="释放内容" alt="" coords="149,56,228,83"/>
<area shape="poly" title=" " alt="" coords="281,104,228,85,230,80,283,99"/>
<area shape="rect" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title=" " alt="" coords="164,107,214,133"/>
<area shape="poly" title=" " alt="" coords="275,123,214,123,214,117,275,117"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a50348bdb1b8eaaeb2ec6723ec36abc94" title="条件删除操作" alt="" coords="135,157,243,184"/>
<area shape="poly" title=" " alt="" coords="283,141,231,159,230,154,282,136"/>
<area shape="rect" href="../../d4/d4d/classtree.html#aca269a11ef91945884af6bc8618434e1" title=" " alt="" coords="5,56,87,83"/>
<area shape="poly" title=" " alt="" coords="134,72,87,72,87,67,134,67"/>
</map>
</div>

</div>
</div>
<a id="af038db2797b1462eaa1cc42a875087f2" name="af038db2797b1462eaa1cc42a875087f2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af038db2797b1462eaa1cc42a875087f2">&#9670;&#160;</a></span>parent() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::parent </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *</td>          <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>指定父亲节点 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">p[</td><td>I ] , 父亲节点指针 </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00206">206</a> 行定义.</p>

</div>
</div>
<a id="a54951c8d6a396be5c3ef091cae7386e5" name="a54951c8d6a396be5c3ef091cae7386e5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a54951c8d6a396be5c3ef091cae7386e5">&#9670;&#160;</a></span>pre() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> * <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::pre </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00273">273</a> 行定义.</p>
<div class="dynheader">
这是这个函数的调用关系图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_a54951c8d6a396be5c3ef091cae7386e5_icgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_a54951c8d6a396be5c3ef091cae7386e5_icgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_a54951c8d6a396be5c3ef091cae7386e5_icgraph" id="ad1/d44/classtree_1_1tree_node_a54951c8d6a396be5c3ef091cae7386e5_icgraph">
<area shape="rect" title=" " alt="" coords="454,81,585,108"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a56c4fd6197458cd9221aa73ca1292555" title="后根遍历，采用后根遍历非常方便销毁对象" alt="" coords="291,5,406,32"/>
<area shape="poly" title=" " alt="" coords="473,77,405,46,380,35,382,30,407,42,475,72"/>
<area shape="rect" href="../../d4/d4d/classtree.html#ad2c4e9d187d6364bb08bbeb233949687" title=" " alt="" coords="307,56,390,83"/>
<area shape="poly" title=" " alt="" coords="439,85,390,78,391,73,440,80"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a265eb5fcb1aab37f8bfc746f6bf4fb77" title=" " alt="" coords="307,107,390,133"/>
<area shape="poly" title=" " alt="" coords="440,109,391,117,390,111,439,104"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a73beb0e756fc71efca1224f31e0925b7" title="删除节点" alt="" coords="302,157,396,184"/>
<area shape="poly" title=" " alt="" coords="475,117,407,148,382,159,380,154,405,143,473,112"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a764ccf0cec30d22799367817dbf77458" title="释放内容" alt="" coords="149,44,228,71"/>
<area shape="poly" title=" " alt="" coords="277,39,230,50,228,45,275,34"/>
<area shape="rect" href="../../d4/d4d/classtree.html#aca269a11ef91945884af6bc8618434e1" title=" " alt="" coords="5,44,87,71"/>
<area shape="poly" title=" " alt="" coords="134,60,87,60,87,55,134,55"/>
<area shape="poly" title=" " alt="" coords="297,152,290,148,239,109,202,73,205,69,243,105,292,143,300,148"/>
<area shape="rect" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title=" " alt="" coords="164,132,214,159"/>
<area shape="poly" title=" " alt="" coords="286,163,213,152,214,147,287,158"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a50348bdb1b8eaaeb2ec6723ec36abc94" title="条件删除操作" alt="" coords="135,183,243,209"/>
<area shape="poly" title=" " alt="" coords="287,183,244,190,243,185,286,178"/>
</map>
</div>

</div>
</div>
<a id="a8b98396d128d71c2c1dc053130bce09e" name="a8b98396d128d71c2c1dc053130bce09e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8b98396d128d71c2c1dc053130bce09e">&#9670;&#160;</a></span>pre() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::pre </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *</td>          <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00274">274</a> 行定义.</p>

</div>
</div>
<a id="a0577532f377d701d96c4822b3fc45192" name="a0577532f377d701d96c4822b3fc45192"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0577532f377d701d96c4822b3fc45192">&#9670;&#160;</a></span>push_child() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::push_child </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>添加孩子节点。这个操作在孩子节点的最后追加内容 </p>
<dl class="params"><dt>参数</dt><dd>
  <table class="params">
    <tr><td class="paramname">node[</td><td>I ] , 要添加的孩子节点。 </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00211">211</a> 行定义.</p>
<div class="dynheader">
函数调用图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_cgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_cgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_cgraph" id="ad1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_cgraph">
<area shape="rect" title="添加孩子节点。这个操作在孩子节点的最后追加内容" alt="" coords="5,5,146,48"/>
<area shape="rect" href="../../d1/d44/classtree_1_1tree_node.html#a1dd627bd23e96af4a68b0a7a5830619d" title=" " alt="" coords="194,13,359,40"/>
<area shape="poly" title=" " alt="" coords="146,24,178,24,178,29,146,29"/>
</map>
</div>
<div class="dynheader">
这是这个函数的调用关系图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_icgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_icgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_icgraph" id="ad1/d44/classtree_1_1tree_node_a0577532f377d701d96c4822b3fc45192_icgraph">
<area shape="rect" title="添加孩子节点。这个操作在孩子节点的最后追加内容" alt="" coords="278,99,418,141"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a75e48363bb7d31de42b18a63bb06afed" title="在给定的父节点下添加一个孩子节点。这个函数只会在父节点下的所有孩子节点最后添加" alt="" coords="147,31,230,57"/>
<area shape="poly" title=" " alt="" coords="287,94,217,60,219,55,289,89"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a71b5751a6a55395afe0e65c28e37597a" title=" " alt="" coords="147,81,230,108"/>
<area shape="poly" title=" " alt="" coords="262,109,230,104,231,99,263,104"/>
<area shape="rect" href="../../d4/d4d/classtree.html#ad2c4e9d187d6364bb08bbeb233949687" title=" " alt="" coords="147,132,230,159"/>
<area shape="poly" title=" " alt="" coords="263,136,231,141,230,136,262,131"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a265eb5fcb1aab37f8bfc746f6bf4fb77" title=" " alt="" coords="147,183,230,209"/>
<area shape="poly" title=" " alt="" coords="289,151,219,185,217,180,287,146"/>
<area shape="rect" href="../../dc/d2f/classfs.html#aca59d4eca486930e503c0e6902ae591c" title="枚举文件，将指定目录按照原本的结构整理成一个可以以树形结构遍历的数据" alt="" coords="5,5,99,32"/>
<area shape="poly" title=" " alt="" coords="131,36,99,30,100,25,132,31"/>
<area shape="rect" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title=" " alt="" coords="27,56,77,83"/>
<area shape="poly" title=" " alt="" coords="132,57,78,67,77,62,131,52"/>
</map>
</div>

</div>
</div>
<a id="a73c9ec86ad94e0fcffca2c97d68a5b6c" name="a73c9ec86ad94e0fcffca2c97d68a5b6c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a73c9ec86ad94e0fcffca2c97d68a5b6c">&#9670;&#160;</a></span>push_child() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::push_child </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *</td>          <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00233">233</a> 行定义.</p>

</div>
</div>
<a id="ad60ae0d2ef5ed5d67141975493bc257c" name="ad60ae0d2ef5ed5d67141975493bc257c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad60ae0d2ef5ed5d67141975493bc257c">&#9670;&#160;</a></span>sibling() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> * <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::sibling </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>取弟弟节点指针 </p>
<dl class="section return"><dt>返回</dt><dd>返回节点指针 </dd></dl>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00253">253</a> 行定义.</p>
<div class="dynheader">
这是这个函数的调用关系图:</div>
<div class="dyncontent">
<div class="center"><img src="../../d1/d44/classtree_1_1tree_node_ad60ae0d2ef5ed5d67141975493bc257c_icgraph.png" border="0" usemap="#ad1/d44/classtree_1_1tree_node_ad60ae0d2ef5ed5d67141975493bc257c_icgraph" alt=""/></div>
<map name="ad1/d44/classtree_1_1tree_node_ad60ae0d2ef5ed5d67141975493bc257c_icgraph" id="ad1/d44/classtree_1_1tree_node_ad60ae0d2ef5ed5d67141975493bc257c_icgraph">
<area shape="rect" title="取弟弟节点指针" alt="" coords="454,107,604,133"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a195cb527a182cacf1bfa1521a7a64e91" title="后根遍历" alt="" coords="298,5,399,32"/>
<area shape="poly" title=" " alt="" coords="494,100,405,46,382,35,384,30,408,42,496,96"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a56c4fd6197458cd9221aa73ca1292555" title="后根遍历，采用后根遍历非常方便销毁对象" alt="" coords="291,56,406,83"/>
<area shape="poly" title=" " alt="" coords="463,104,398,86,400,81,465,99"/>
<area shape="rect" href="../../d4/d4d/classtree.html#ad2c4e9d187d6364bb08bbeb233949687" title=" " alt="" coords="307,107,390,133"/>
<area shape="poly" title=" " alt="" coords="439,123,391,123,391,117,439,117"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a265eb5fcb1aab37f8bfc746f6bf4fb77" title=" " alt="" coords="307,157,390,184"/>
<area shape="poly" title=" " alt="" coords="465,141,391,162,390,157,463,136"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a73beb0e756fc71efca1224f31e0925b7" title="删除节点" alt="" coords="302,208,396,235"/>
<area shape="poly" title=" " alt="" coords="496,144,408,198,384,210,382,205,405,194,494,140"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a764ccf0cec30d22799367817dbf77458" title="释放内容" alt="" coords="149,95,228,121"/>
<area shape="poly" title=" " alt="" coords="277,89,230,101,228,96,275,84"/>
<area shape="rect" href="../../d4/d4d/classtree.html#aca269a11ef91945884af6bc8618434e1" title=" " alt="" coords="5,95,87,121"/>
<area shape="poly" title=" " alt="" coords="134,111,87,111,87,105,134,105"/>
<area shape="poly" title=" " alt="" coords="297,203,290,198,239,160,202,124,205,120,243,156,292,194,300,198"/>
<area shape="rect" href="../../de/d8d/bplus_8hpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title=" " alt="" coords="164,183,214,209"/>
<area shape="poly" title=" " alt="" coords="286,214,213,202,214,197,287,209"/>
<area shape="rect" href="../../d4/d4d/classtree.html#a50348bdb1b8eaaeb2ec6723ec36abc94" title="条件删除操作" alt="" coords="135,233,243,260"/>
<area shape="poly" title=" " alt="" coords="287,234,244,241,243,235,286,229"/>
</map>
</div>

</div>
</div>
<a id="a8547b8461dcb4910d53d315dcfeea72f" name="a8547b8461dcb4910d53d315dcfeea72f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8547b8461dcb4910d53d315dcfeea72f">&#9670;&#160;</a></span>sibling() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::sibling </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="../../d1/d44/classtree_1_1tree_node.html">treeNode</a> *</td>          <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>指定弟弟节点指针 </p>

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00257">257</a> 行定义.</p>

</div>
</div>
<a id="a7b3be6afa52cd3925fee6d4a242dc11c" name="a7b3be6afa52cd3925fee6d4a242dc11c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7b3be6afa52cd3925fee6d4a242dc11c">&#9670;&#160;</a></span>value()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="../../d4/d4d/classtree.html#a1b7a5e12c580b76d8615985ede1ed40d">value_type</a> &amp; <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::value </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00285">285</a> 行定义.</p>

</div>
</div>
<a id="a18d37a3a72ba31ff3450f33e21de1415" name="a18d37a3a72ba31ff3450f33e21de1415"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a18d37a3a72ba31ff3450f33e21de1415">&#9670;&#160;</a></span>value_ptr()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="../../d4/d4d/classtree.html#af759e7012e9659595dcc1ba52d4b326f">pointer</a> <a class="el" href="../../d4/d4d/classtree.html">tree</a>&lt; type, metaType, T &gt;::treeNode::value_ptr </td>
          <td>(</td>
          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00291">291</a> 行定义.</p>

</div>
</div>
<h2 class="groupheader">友元及相关符号说明</h2>
<a id="a274b977404a53ceb91af64dfd96c9641" name="a274b977404a53ceb91af64dfd96c9641"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a274b977404a53ceb91af64dfd96c9641">&#9670;&#160;</a></span>tree</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename type , typename metaType  = typename std::decay&lt; type &gt; :: type, typename T  = typename std::conditional&lt; std::is_pointer&lt; metaType &gt;::value,					 typename std::remove_pointer&lt; metaType &gt;::type,					 metaType					 &gt;::type&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">friend class <a class="el" href="../../d4/d4d/classtree.html">tree</a></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">friend</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a> 第 <a class="el" href="../../de/dfd/tree_8hpp_source.html#l00049">49</a> 行定义.</p>

</div>
</div>
<hr/>该类的文档由以下文件生成:<ul>
<li>include/<a class="el" href="../../de/dfd/tree_8hpp_source.html">tree.hpp</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
制作者&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.11.0
</small></address>
</div><!-- doc-content -->
</body>
</html>
